Forbidden graphs for classes of split-like graphs
نویسندگان
چکیده
منابع مشابه
Forbidden graphs for tree-depth
For every k ≥ 0, we define Gk as the class of graphs with tree-depth at most k, i.e. the class containing every graph G admitting a valid colouring ρ : V (G) → {1, . . . , k} such that every (x, y)-path between two vertices where ρ(x) = ρ(y) contains a vertex z where ρ(z) > ρ(x). In this paper we study the set of graphs not belonging in Gk that are minimal with respect to the minor/subgraph/ind...
متن کاملOn equistable, split, CIS, and related classes of graphs
We consider several graphs classes defined in terms of conditions on cliques and stable sets, including CIS, split, equistable, and other related classes. We pursue a systematic study of the relations between them. As part of this study, we introduce two generalizations of CIS graphs, obtain a new characterization of split graphs, and a characterization of CIS line graphs.
متن کاملForbidden Subsystem Characterization of Matroids and Applications to Classes of Matroid Generating Graphs Forbidden Subsystem Characterization of Matroids and Applications to Classes of Matroid Generating Graphs
We provide a forbidden induced subsystem characterization of those independence systems which are matroids. On this basis we describe a method for characterizing classes of matroid-deening graphs, associated to every hereditary graph property.
متن کاملForbidden induced bipartite graphs
Given a fixed bipartite graph H, we study the asymptotic speed of growth of the number of bipartite graphs on n vertices which do not contain an induced copy of H. Whenever H contains either a cycle or the bipartite complement of a cycle, the speed of growth is 2Ω(n 6 5 ). For every other bipartite graph except the path on seven vertices, we are able to find both upper and lower bounds of the f...
متن کاملGraphs with Forbidden Subgraphs
Many graphs which are encountered in the study of graph theory are characterized by a type of configuration or subgraph they possess. However, there are occasions when such graphs are more easily defined or described by the kind of subgraphs they are not permitted to contain. For example, a tree can be defined as a connected graph which contains no cycles, and Kuratowski [22] characterized plan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2014
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2013.12.004